Bipartite distance-regular graphs of valency three
نویسندگان
چکیده
منابع مشابه
The Distance-Regular Graphs of Valency Four
We show that each distance-regular graph of valency four has known parameters.
متن کاملA characterization of bipartite distance-regular graphs
Article history: Received 9 April 2013 Accepted 15 December 2013 Available online 13 January 2014 Submitted by R. Brualdi
متن کاملCodes in Bipartite Distance^regular Graphs
For each bipartition_of a bipartite distance-regular graph F, there naturally corresponds another distance-regular graph F called a halved graph. It is shown that the existence of a perfect e-code in a halved graph F is equivalent to the existence of a uniformly packed 2e-code in F with certain specific parameters. Using this equivalence, we show the non-existence of perfect codes for two class...
متن کاملOn bipartite Q-polynomial distance-regular graphs
Let Γ denote a bipartite Q-polynomial distance-regular graph with vertex set X, diameter d ≥ 3 and valency k ≥ 3. Let RX denote the vector space over R consisting of column vectors with entries in R and rows indexed by X. For z ∈ X, let ẑ denote the vector in RX with a 1 in the z-coordinate, and 0 in all other coordinates. Fix x, y ∈ X such that ∂(x, y) = 2, where ∂ denotes path-length distance...
متن کاملBipartite Distance-regular Graphs, Part II
This is a continuation of ``Bipartite Distance-regular Graphs, Part I''. We continue our study of the Terwilliger algebra T of a bipartite distance-regular graph. In this part we focus on the thin irreducible T-modules of endpoint 2 and on those distance-regular graphs for which every irreducible T-module of endpoint 2 is thin. 8. Introduction to Part II Let G X ;E denote a bipartite distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1982
ISSN: 0024-3795
DOI: 10.1016/0024-3795(82)90035-0